The Z4-linearity of Kerdock, Preparata, Goethals, and related codes

نویسندگان

  • A. Roger Hammons
  • P. Vijay Kumar
  • A. Robert Calderbank
  • N. J. A. Sloane
  • Patrick Solé
چکیده

Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed by Nordstrom-Robinson , Kerdock, Preparata, Goethals, and Delsarte-Goethals . It is shown here that all these codes can be very simply constructed as binary images under the Gray map of linear codes over Z4, the integers mod 4 (although this requires a slight modification of the Preparata and Goethals codes). The construction implies that all these binary codes are distance invariant. Duality in the Z4 domain implies that the binary images have dual weight distributions. The Kerdock and ‘Preparata’ codes are duals over Z4 — and the Nordstrom-Robinson code is self-dual — which explains why their weight distributions are dual to each other. The Kerdock and ‘Preparata’ codes are Z4-analogues of first-order Reed-Muller and extended Hamming codes, respectively. All these codes are extended cyclic codes over Z4, which greatly simplifies encoding and decoding. An algebraic hard-decision decoding algorithm is given for the ‘Preparata’ code and a Hadamard-transform soft-decision decoding algorithm for the Kerdock code. Binary firstand second-order ReedMuller codes are also linear over Z4, but extended Hamming codes of length n ≥ 32 and the Golay code are not. Using Z4-linearity, a new family of distance regular graphs are constructed on the cosets of the ‘Preparata’ code. A different version of this paper appeared in: IEEE Trans. Inform. Theory, 40 (1994), 301–319. The work of A. R. Hammons, Jr. and P. V. Kumar was supported in part by the National Science Foundation under Grant NCR-9016077 and by Hughes Aircraft Company under its Ph.D. fellowship program. P. Solé thanks the DIMACS Center and the IEEE for travel support. The Z4-Linearity of Kerdock, Preparata, Goethals and Related Codes A. Roger Hammons, Jr.** Hughes Aircraft Company Network Systems Division, Germantown, MD 20876 U.S.A. P. Vijay Kumar** Communication Science Institute, EE-Systems University of Southern California, Los Angeles, CA 90089 U.S.A. A. R. Calderbank and N. J. A. Sloane Mathematical Sciences Research Center AT&T Bell Laboratories, Murray Hill, NJ 07974 U.S.A. Patrick Solé CNRS – I3S, 250 rue A. Einstein, bâtiment 4 Sophia – Antipolis, 06560 Valbonne, France

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

4 - Linearity of Kerdock , Preparata , Goethals and Related Codes ∗

Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed by Nordstrom-Robinson , Kerdock, Preparata, Goethals, and Delsarte-Goethals . It is shown here that all these codes can be very simply constructed as binary images under the Gray map of linear codes over 4, the integers mod 4 (although this requires a slight modificati...

متن کامل

New Ring-Linear Codes from Geometric Dualization

In the 1960s and 1970s the Nordstrom-Robinson-Code [30] and subsequently the infinite series of the Preparata[31], Kerdock[21], Delsarte-Goethals[6] and Goethals-Codes [7] were discovered. Apart from a few corner cases, all of these codes are non-linear binary block codes that have higher minimum distance than any known comparable (having equal size and length) linear binary code. We will call ...

متن کامل

On the Apparent Duality of the Kerdock and Preparata Codes

The Kerdock and extended Preparata codes are something of an enigma in coding theory since they are both Hamming-distance invariant and have weight enumerators that are MacWilliams duals just as if they were dual linear codes. In this paper, we explain, by constructing in a natural way a Preparata-like code PL from the Kerdock code K, why the existence of a distance-invariant code with weight d...

متن کامل

Four Applications of Z 4-codes

[1] A. Bonnecaze, C. Bachoc,P. Solé, B. Mourrain Type II Codes over Z4 , IEEE Trans. on Information Theory, 43 (1997) 969-976. [2] A. Bonnecaze, P. Solé, A.R. Calderbank, Quaternary Construction of Unimodular Lattices, IEEE Trans. on Information Theory , 41 , (1995) 366-377. [3] A. Bonnecaze, E.M. Rains,P. Solé, 3-Colored 5-Designs and Z4-Codes , J. Statistical Plan. Inf., 86 (2000) 349-368. [4...

متن کامل

On the kernel and rank of Z 4 - linear Preparata - like and Kerdock - like codes ∗

We say that a binary code of length n is additive if it is isomorphic to a subgroup of Z2 ×Zβ4 , where the quaternary coordinates are transformed to binary by means of the usual Gray map and hence α + 2β = n. In this paper we prove that any additive extended Preparata-like code always verifies α = 0, i.e. it is always a Z4-linear code. Moreover, we compute the rank and the dimension of the kern...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 40  شماره 

صفحات  -

تاریخ انتشار 1994